A case for cross layer design: the impact of physical layer properties on routing protocol performance in MANETs

In this work we evaluate the performance of routing protocols for mobile ad hoc networks using different physical layer models. The results obtained show that the performance results obtained using idealized models such as the free space propagation model vary significantly when propagation effects such as path loss and shadowing are considered. This difference in performance indicates that optimization is required in the protocol development space that takes into account channel state information (CSI). Such an optimization requires a cross layer approach to be adopted and a framework for protocol performance evaluation to be established. We believe that this work would serve as a first step in this direction. We provide comparative performance results through network simulations.<br /

Exploiting affinity propagation for energy-efficient information discovery in sensor networks

Wireless sensor networks (WSN) are attractive for information gathering in large-scale data rich environments. Emerging WSN applications require dissemination of information to interested clients within the network requiring support for differing traffic patterns. Further, in-network query processing capabilities are required for autonomic information discovery. In this paper, we formulate the information discovery problem as a load-balancing problem, with the combined aim being to maximize network lifetime and minimize query processing delay. We propose novel methods for data dissemination, information discovery and data aggregation that are designed to provide significant QoS benefits. We make use of affinity propagation to group &quot;similar&quot; sensors and have developed efficient mechanisms that can resolve both ALL-type and ANY-type queries in-network with improved energy-efficiency and query resolution time. Simulation results prove the proposed method(s) of information discovery offer significant QoS benefits for ALL-type and ANY-type queries in comparison to previous approaches.<br /

Information theory based detection against network behavior mimicking DDoS attacks

DDoS is a spy-on-spy game between attackers and detectors. Attackers are mimicking network traffic patterns to disable the detection algorithms which are based on these features. It is an open problem of discriminating the mimicking DDoS attacks from massive legitimate network accessing. We observed that the zombies use controlled function(s) to pump attack packages to the victim, therefore, the attack flows to the victim are always share some properties, e.g. packages distribution behaviors, which are not possessed by legitimate flows in a short time period. Based on this observation, once there appear suspicious flows to a server, we start to calculate the distance of the package distribution behavior among the suspicious flows. If the distance is less than a given threshold, then it is a DDoS attack, otherwise, it is a legitimate accessing. Our analysis and the preliminary experiments indicate that the proposed method- can discriminate mimicking flooding attacks from legitimate accessing efficiently and effectively. <br /

Secure ownership transfer in multi-tag/multi-owner passive RFID systems

In this paper we propose a secure ownership transfer protocol for a multi-tag and multi-owner RFID environment. Most of the existing work in this area do not comply with the EPC Global Class-1 Gen-2 (C1G2) standard since they use expensive hash operations or sophisticated encryption schemes that cannot be implemented on low-cost passive tags that are highly resource constrained. Our work aims to fill this gap by proposing a protocol based on simple XOR and 128-bit Pseudo Random Number Generators (PRNG), operations that can be easily implemented on low-cost passive RFID tags. The protocol thus achieves EPC C1G2 compliance while meeting the security requirements. Also, our protocol provides additional protection using a blind-factor to prevent tracking attacks

Lightweight authentication for recovery in wireless sensor networks

Wireless sensor networks (WSNs) suffer from a wide range of security attacks due to their limited processing and energy capabilities. Their use in numerous mission critical applications, however, requires that fast recovery from such attacks be achieved. Much research has been completed on detection of security attacks, while very little attention has been paid to recovery from an attack. In this paper, we propose a novel, lightweight authentication protocol that can secure network and node recovery operations such as re-clustering and reprogramming. Our protocol is based on hash functions and we compare the performance of two well-known lightweight hash functions, SHA-1 and Rabin. We demonstrate that our authentication protocol can be implemented efficiently on a sensor network test-bed with TelosB motes. Further, our experimental results show that our protocol is efficient both in terms of computational overhead and execution times which makes it suitable for low resourced sensor devices.<br /

Service Engineering Based on Service Oriented Architecture Methodology

Service Engineering (SE) and Service Oriented Architecture (SOA) originally reside on different plateaus of discipline. SE is defined as a set of activity introducing a new business service, while SOA is a technical approach to redefine an enterprise business processes as a set of IT enabled services. This paper proposes a SOA embedded SE framework as a comprehensive approach in re-defining business service and its IT implementation. After an introduction, a review of existing SE frameworks and SOA methodologies is presented in the paper. Afterward, a complete SE framework is proposed with several results on early case studies. A survey results are then presented to prove the usability and benefit of the proposed framework. The framework is designed and proposed to help practitioners and researchers to conduct service engineering by employing principles and methodology offered by SOA approach

Address reuse in wireless sensor networks

Sensor Networks have applications in diverse fields. While unique addressing is not a requirement of many data collecting applications of wireless sensor networks, it is vital for the success of applications such as emergency response. Data that cannot be associated with a specific node becomes useless in such situations. In this work we propose a dynamic addressing mechanism for wireless sensor networks. The scheme enables successful reuse of addresses in event-driven wireless sensor networks. It also eliminates the need for network-wide Duplicate Address Detection (DAD) to ensure uniqueness of network level addresses.<br /

Topology based packet marking for IP traceback

IP source address spoofing exploits a fundamental weakness in the Internet Protocol. It is exploited in many types of network-based attacks such as session hijacking and Denial of Service (DoS). Ingress and egress filtering is aimed at preventing IP spoofing. Techniques such as History based filtering are being used during DoS attacks to filter out attack packets. Packet marking techniques are being used to trace IP packets to a point that is close as possible to their actual source. Present IP spoofing&nbsp; countermeasures are hindered by compatibility issues between IPv4 and IPv6, implementation issues and their effectiveness under different types of attacks. We propose a topology based packet marking method that builds on the flexibility of packet marking as an IP trace back method while overcoming most of the shortcomings of present packet marking techniques.<br /

Theorizing the Transcendent Persona: Amelia Earhart’s Vision in The Fun of It

In this article, we define and theorize the ‘‘transcendent persona,’’ a discursive strategy in which a rhetor draws from a boundary-breaking accomplishment and utilizes the symbolic capital of that feat to persuasively delineate unconventional ways of communicating and behaving in society. Aviator Amelia Earhart’s autobiography The Fun of It (1932) functions as an instructive representative anecdote of this concept and demonstrates that the transcendent persona’s persuasive force hinges on one’s ability to balance distance from audiences with similarities to them. Striking such a balance creates a platform for rhetors to promote transformative visions of society. Earhart utilized the transcendent persona to illustrate an alternative vocabulary of what contemporary theorists might call feminine gender performativity. The article concludes by exploring the implications of the transcendent persona as an enduring, rhetorical resource for communicators, as well as for scholars of persuasion and social change, religious communication, and communication history